The Bertini irreducibility theorem for higher codimensional slices

In [3], Poonen and Slavov recently developed a novel approach to Bertini irreducibility theorems over an arbitrary field, based on random hyperplane slicing. In this paper, we extend their work by proving an analogous bound for the dimension of the exceptional locus in the setting of linear subspaces of higher codimensions.     

Graphs are (1,Δ+1)-choosable

A graph $G$ is $(k,k^{\prime })$-choosable if the following holds: For any list assignment $L$ which assigns to each vertex $v$ a set $L\left(v\right)$ of $k$ real numbers, and assigns to each edge $e$ a set $L\left(e\right)$ of $k^{\prime }$ real numbers, there is a total weighting $?:V\left(G\right)\cup E\left(G\right)\to R$ such that $?\left(z\right)\in L\left(z\right)$ for $z\in V\cup E$, and ${\sum }_{e\in E\left(u\right)}?\left(e\right)+?\left(u\right)\ne {\sum }_{e\in E\left(v\right)}?\left(e\right)+?\left(v\right)$ for every edge $uv$. This paper proves that if $G$ is a connected graph of maximum degree $\Delta \ge 2$, then $G$ is $(1,\Delta +1)$-choosable.     

基于毛竹叶片理化参数的刚竹毒蛾危害检测研究

虫害检测算法研究是开展虫害快速、准确监测，制定精准森防检疫措施的重要基础。以毛竹叶片为研究尺度，基于刚竹毒蛾危害下的寄主外部形态与内部生理现象总结，选择并实测叶损量LL、相对叶绿素含量RCC、相对含水量RWC、原始光谱的733.66~898.56 nm值(ρ_{733.66~898.56})、一阶微分光谱的562.95~585.25 nm值(ρ′_{562.95~585.25})与706.18~725.41 nm值(ρ′_{706.18~725.41})等理化参数，随机划分实验组(63组)和验证组(37组)并设计5次重复实验；分别运用Fisher判别分析、BP神经网络、随机森林等三种方法建立刚竹毒蛾危害等级的检测模型，从检测精度、Kappa系数及R2等指标对模型的检测效果予以分析和比较。结果显示，Fisher判别分析、BP神经网络、随机森林的检测精度分别为69.19%，65.41%，83.78%，Kappa系数分别为0.576 9，0.532 4和0.778 8，R2分别为0.722 2，0.582 6和0.870 9，总体而言，三种方法均具备刚竹毒蛾危害的检测能力，随机森林的检测效果最优，Fisher判别分析次之，再次为BP神经网络；从分等级来看，随机森林的检测精度亦优于Fisher判别分析与BP神经网络，但3种方法对中度危害等级的检测精度均有所不足。该成果可为刚竹毒蛾危害及其他病虫害检测算法的选择提供参考，并为进一步建立冠层、遥感影像像元等尺度的虫害检测模型奠定基础。     

Compressibility of random walker trajectories on growing networks

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible.     

基于计算机视觉技术的茶叶品质随机森林感官评价方法研究

为弥补茶叶品质感官审评存在的缺陷，利用计算机视觉技术对茶叶品质进行快速无损评价研究。以碧螺春绿茶为对象，依据专家感官审评结果，将茶样分成4个等级；采用中值滤波及拉普拉斯算子对茶样图像进行预处理，并提取预处理后的茶样图像的颜色特征和纹理特征以表征茶叶图像的外形特征，利用随机森林算法对茶叶外形特征属性进行重要性排序；筛选出重要性较大的特征及随机森林算法中最优的决策树棵数建立感官评价模型，并与建立的支持向量机(SVM)模型性能相比较。结果表明：色调均值、色调标准差、绿体均值、平均灰度级、饱和度均值、红体均值、饱和度标准差、亮度均值、一致性等9个特征属性的重要性较大，且与感官审评特征描述结果相一致；当采用优选出的9个重要性较大的特征及决策数棵数为500时，建立的模型性能最优，模型总体判别率为95.75%，Kappa系数为0.933，OOB误差为5%，较SVM模型分别提高了3.5%，0.066，优选的9个重要性较大的图像特征与感官审评特征描述相一致。研究表明：利用随机森林方法筛选出对茶叶外形特征属性贡献最大的少数几个特征建立模型，模型性能就能达到很好的识别效果，模型得到简化，同时模型精度和稳定性都高于其他方法。